Optimal layouts on a chain ATM network

Optimal layouts on a chain ATM network

We study a routing problem which occurs in high-speed (ATM) networks, termed the “rooted virtual path layout problem” on chain networks. This problem is essentially a tree embedding problem on a chain host graph. We present four performance measures for the quality of such an embedding which have practical implications, and find optimal solutions for each of them. We first show that the search ...

Duality in Chain ATM Virtual Path Layouts

We present certain dualities occuring in the study of routing problems within ATM networks We concentrate on the one to many problem on a chain network in which one constructs a set of paths that enable connecting one vertex with all others in the network We consider the parameters of load the maximum number of paths that go through any single edge and hop count the maximum number of paths trav...

Wireless ATM Layouts for Chain Networks ∗ , ∗ ∗ MICHELE

In this paper we consider the problem of constructing ATM layouts for wireless networks in which mobile users can move along a chain of base stations. We first show that deciding the existence of a layout with maximum hop count h, load l and channel distance d is NP-complete for every fixed value of d greater or equal to 1. We then provide optimal layout constructions for the case d 2. Finally,...

Dynamic Layouts for Wireless ATM

Directed Virtual Path Layouts in ATM Networks

Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). Fo...